A geometrical approach to multiset orderings
نویسندگان
چکیده
منابع مشابه
On the Formalization of Termination Techniques based on Multiset Orderings
Multiset orderings are a key ingredient in certain termination techniques like the recursive path ordering and a variant of size-change termination. In order to integrate these techniques in a certifier for termination proofs, we have added them to the Isabelle Formalization of Rewriting. To this end, it was required to extend the existing formalization on multiset orderings towards a generaliz...
متن کاملA Geometrical Approach to Aggregation
Considering the family F of contour curves F = {h(x, y) = k) of an (idempotent) aggregation operator h in two variables as a oneparametric family of curves, the differential equation y′ = f(x, y) having F as general solution is associated to h. Properties of h have then be translated to properties of its differential equation. Reciprocally, for a differential equation fulfilling some easy prope...
متن کاملA Geometrical Approach to Item Response Theory
How critical is the concept of the latent trait to modern test theory ? The appeal to some unobservable characteristic modulating response probability can lead to some confusion and misunderstanding among users of psychometric technology. This paper looks at a geometric formulation of item response theory that avoids the need to appeal to unobservables. It draws on concepts in differential geom...
متن کاملA non-geometrical approach to quantum gravity
Some results of author’s work in a non-geometrical approach to quantum gravity are reviewed here, among them: a quantum mechanism of classical gravity giving a possibility to compute the Newton constant; asymptotic freedom at short distances; interaction of photons with the graviton background leading to the important cosmological consequences; the time delay of photons due to interactions with...
متن کاملA Geometrical Approach to Imprimitive Graphs
We establish a geometrical framework for the study of imprimitive, G-symmetric graphs F by exploiting the fact that any G-partition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block B e B . We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90020-0